Recursive unsupervised learning of finite mixture models
نویسندگان
چکیده
منابع مشابه
Unsupervised Learning of Finite Mixture Models
ÐThis paper proposes an unsupervised algorithm for learning a finite mixture model from multivariate data. The adjective ªunsupervisedº is justified by two properties of the algorithm: 1) it is capable of selecting the number of components and 2) unlike the standard expectation-maximization (EM) algorithm, it does not require careful initialization. The proposed method also avoids another drawb...
متن کاملUnsupervised Selection and Estimation of Finite Mixture Models
We propose a new method for fitting mixture models that performs component selection and does not require external initialization. The novelty of our approach includes: a minimum message length (MML) type model selection criterion; the inclusion of the criterion into the expectation-maximization (EM) algorithm (which also increases its ability to escape from local maxima); an initialization str...
متن کاملUnsupervised Learning of Finite Gaussian Mixture Models (GMMs): A Greedy Approach
In this work we propose a clustering algorithm that learns on-line a finite gaussian mixture model from multivariate data based on the expectation maximization approach. The convergence of the right number of components as well as their means and covariances is achieved without requiring any careful initialization. Our methodology starts from a single mixture component covering the whole data s...
متن کاملUnsupervised Learning of Gamma Mixture Models Using Minimum Message Length
Mixture modelling or unsupervised classification is a problem of identifying and modelling components in a body of data. Earlier work in mixture modelling using Minimum Message Length (MML) includes the multinomial and Gaussian distributions (Wallace and Boulton, 1968), the von Mises circular and Poisson distributions (Wallace and Dowe, 1994, 2000) and the distribution (Agusta and Dowe, 2002a, ...
متن کاملUnsupervised Learning of Mixture Models with a Uniform Background Component
Gaussian Mixture Models are one of the most studied and mature models in unsupervised learning. However, outliers are often present in the data and could influence the cluster estimation. In this paper, we study a new model that assumes that data comes from a mixture of a number of Gaussians as well as a uniform “background” component assumed to contain outliers and other non-interesting observ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2004
ISSN: 0162-8828
DOI: 10.1109/tpami.2004.1273970